MFPS 2007 Skeletons , Homomorphisms , and Shapes : Characterizing Protocol Executions 1
نویسندگان
چکیده
In this paper we develop a framework, based on strand spaces, for reasoning about cryptographic protocols and characterizing their executions. We define skeletons, homomorphisms, and shapes. Skeletons model partial information about regular (honest) behavior in an execution of a cryptographic protocol. A homomorphism between skeletons is an information-preserving map. Much protocol analysis may be regarded as an exploration of the properties of the category of skeletons and homomorphisms. A set of skeletons can characterize all runs of the protocol; the smallest such set is the set of shapes. This approach is a foundation for mechanizing protocol analysis.
منابع مشابه
Skeletons, Homomorphisms, and Shapes: Characterizing Protocol Executions
Most protocol analysis tools and techniques operate by proving/disproving security properties of a protocol formulated as predicates in a specific logic. Starting from some initial assumptions, theorem proving or model checking (such as in [8]) techniques can be used to check if a certain security property follows. In this paper, we take a different approach to this problem. Instead of checking...
متن کاملSkeletons and the Shapes of Bundles
Skeletons model partial information about regular (honest) behavior in an execution of a cryptographic protocol. A homomorphism between skeletons is an information-preserving map. Much protocol analysis may be regarded as an exploration of the properties of the category of skeletons and homomorphisms. In particular, the strand space authentication tests are special homomorphisms. These ideas su...
متن کاملCompleteness of the Authentication Tests
The shapes of a cryptographic protocol are its minimal, essentially different executions. In previous work, we have described a search algorithm to discover the shapes of a protocol, and implemented the algorithm in a Cryptographic Protocol Shape Analyzer cpsa. In this paper, we show its completeness, i.e. that every shape can in fact be found in a finite number of steps. The steps in question ...
متن کاملProtocol Security Goals and the Size of Skeletons
We express security goals for a cryptographic protocol in a language of classical first order logic. Its semantics uses realized skeletons, which represent the regular (non-penetrator) parts of possible executions. Security goals are preserved under some homomorphisms between realized skeletons, yielding an appealing proof of the Comon-Lundh/Cortier theorem that two agents are sufficient for te...
متن کاملTransformations between Cryptographic Protocols
A transformation F between protocols associates the messages sent and received by participants in a protocol Π1 with messages sent and received in some Π2. Transformations are useful for modeling protocol design, protocol composition, and the services that protocols provide. A protocol transformation determines a map from partial behaviors A1 of Π1—which we call “skeletons”—to skeletons F (A1) ...
متن کامل